Autonomous mobile robots with lights

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autonomous mobile robots with lights

We consider the well known distributed setting of computational mobile entities, called robots, operating in the Euclidean plane in Look-Compute-Move (LCM) cycles. We investigate the computational impact of expanding the capabilities of the robots by endowing them with an externally visible memory register, called light, whose values, called colors, are persistent, that is they are not automati...

متن کامل

Autonomous Mobile Construction Robots

Many manufacturing companies use autonomous robots to solve a variety of assembly and sorting problems. However, only a few attempts have been made at creating mobile robots capable of autonomously assembling a building or other such structure. The key to this problem is to design a single robot capable of doing the task efficiently and then replicating the core design to create a team of robot...

متن کامل

Autonomous Mobile Robots Designing

This paper presents the overview of robotics and related technologies. Also describes the architecture of robots such as software and hardware requirements. In this paper we give the detail discussion about the autonomous robotics, design, control and applications. This paper presents design concepts and guidelines for implementing an autonomous robot.

متن کامل

Gathering Autonomous Mobile Robots

We study the problem of coordinating a set of autonomous mobile robots that can freely move in a two-dimensional plane; in particular, we want them to gather at a point not fixed in advance (GATHERING PROBLEM). We introduce a model of weak robots (decentralized, asynchronous, no common knowledge, no identities, no central coordination, no direct communication, oblivious) which can observe the s...

متن کامل

Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights

We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights with a constant number of colors in several types lights[9, 20]. In asyn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2016

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2015.09.018